ASM 2004 : abstract state machines : advances in theory and practice (Lutherstadt Wittenberg, 24-28 May 2004)Zimmermann, Wolf; Thalheim, Bernhard.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22094-1, XII, 233 p, isbn 3-540-22094-1Conference Proceedings

Elagage de contexte, retour arrière superficiel, modifications réversibles et autres: une étude approfondie de la WAM = Trimming, Shallow Backtracking, Value-trailing, and Others: A Deep Insight into the WAMNoye, Jacques; Bekkers, Y.1994, 194 p.Thesis

Remarks on two-way automata with weak-countersMIYANO, S.Information processing letters. 1984, Vol 18, Num 2, pp 105-107, issn 0020-0190Article

On the complexity of verifying concurrent transition systemsHAREL, D; KUPFERMAN, O; VARDI, M. Y et al.Lecture notes in computer science. 1997, pp 258-272, issn 0302-9743, isbn 3-540-63141-0Conference Paper

POS-9 : persistenet object systems : design, implementation, and use (Lillehammer, revised papers)Kirby, Graham N.C; Dearle, Alan; Sjøberg, Dag I.K et al.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42735-X, VIII, 319 p, isbn 3-540-42735-XConference Proceedings

Construction of finite labelled transition Systems from B abstract SystemsBERT, Didier; CAVE, Francis.Lecture notes in computer science. 2000, pp 235-254, issn 0302-9743, isbn 3-540-41196-8Conference Paper

On the complexity of interactive proofs with bounded communicationGOLDREICH, O; HASTAD, J.Information processing letters. 1998, Vol 67, Num 4, pp 205-214, issn 0020-0190Article

Randomized algorithms for that ancient scheduling problemSEIDEN, S.Lecture notes in computer science. 1997, pp 210-223, issn 0302-9743, isbn 3-540-63307-3Conference Paper

A token machine for full geometry of interactionLAURENT, Olivier.Lecture notes in computer science. 2001, pp 283-297, issn 0302-9743, isbn 3-540-41960-8Conference Paper

Objects + views = components?ODERSKY, M.Lecture notes in computer science. 2000, pp 50-68, issn 0302-9743, isbn 3-540-67959-6Conference Paper

A geometric proof of confluence by decreasing diagramsKLOP, J. W; VAN OOSTROM, V; DE VRIJER, R et al.Report - Software engineering. 2000, Num 7, pp 1-22, issn 1386-369XArticle

Logspace reducibility via abstract state machinesGRÄDEL, E; SPIELMANN, M.Lecture notes in computer science. 1999, pp 1738-1757, issn 0302-9743, isbn 3-540-66587-0, 2VolConference Paper

Condensed graphs : A multi-level, parallel, intermediate representationMORRISON, J. P; DALTON, N. J.Lecture notes in computer science. 1999, pp 866-876, issn 0302-9743, isbn 3-540-66443-2Conference Paper

The calculus of explicit λψ substitutionsLescanne, Pierre; Rouyer-Degli, Jocelyne.1994, 21 p.Report

A distributed abstract machine for safe ambientsSANGIORGI, Davide; VALENTE, Andrea.Lecture notes in computer science. 2001, pp 408-420, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Intra-step interactionGUREVICH, Yuri.Lecture notes in computer science. 2004, pp 1-5, issn 0302-9743, isbn 3-540-22094-1, 5 p.Conference Paper

Three small Universal Turing MachinesBAIOCCHI, Claudio.Lecture notes in computer science. 2001, pp 1-10, issn 0302-9743, isbn 3-540-42121-1Conference Paper

Abstract state machines at the cusp of the milleniumBURGER, E.Lecture notes in computer science. 2000, pp 1-8, issn 0302-9743, isbn 3-540-67959-6Conference Paper

Refining and compressing abstract domainsGIACOBAZZI, R; RANZATO, F.Lecture notes in computer science. 1997, pp 771-781, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Indecomposable maps in Tessellation structures of arbitrary dimensionMIYAJIMA, H; HARAO, M; NOGUCHI, S et al.Journal of computer and system sciences (Print). 1984, Vol 29, Num 2, pp 171-182, issn 0022-0000Article

A universal Turing machine with 3 states and 9 symbolsKUDLEK, Manfred; ROGOZHIN, Yurii.Lecture notes in computer science. 2002, pp 311-318, issn 0302-9743, isbn 3-540-43453-4Conference Paper

Cost hierarchies for Abstract Parallel machinesO'DONNELL, John; RAUBER, Thomas; RÜNGER, Gudula et al.Lecture notes in computer science. 2001, pp 16-33, issn 0302-9743, isbn 3-540-42862-3Conference Paper

Game theoretic analysis of call-by-value computationHONDA, K; YOSHIDA, N.Lecture notes in computer science. 1997, pp 225-236, issn 0302-9743, isbn 3-540-63165-8Conference Paper

On-line load balancing for related machinesBERMAN, P; CHARIKAR, M; KARPINSKI, M et al.Lecture notes in computer science. 1997, pp 116-125, issn 0302-9743, isbn 3-540-63307-3Conference Paper

A Variant of the Constant Step Rule for Approximate Subgradient Methods over Nonlinear NetworksMIJANGOS, Eugenio.Lecture notes in computer science. 2006, pp 757-766, issn 0302-9743, isbn 3-540-34070-X, 10 p.Conference Paper